منابع مشابه
Conformal Flattening ITK Filter Release 0
This paper describes the Insight Toolkit (ITK) Conformal Flattening filter: itkConformalFlatteningFilter. This ITK filter is an implementation of a paper by Sigurd Angenent, et al., “On the Laplace-Beltrami Operator and Brain Surface Flattening” [1]. This filter performs an angle preserving map of any genus zero (i.e. no handles) surface to the sphere or, alternatively, to the plane. In this pa...
متن کامل0 On Ziv ’ s rounding test
A very simple test, introduced by Ziv, allows one to determine if an approximation to the value f(x) of an elementary function at a given point x suffices to return the floating-point number nearest f(x). The same test may be used when implementing floating-point operations with input and output operands of different formats, using arithmetic operators tailored for manipulating operands of the ...
متن کاملAdipogenesis and Obesity: Rounding Out the Big Picture
1996), provides a key link between peripheral signals and the central pathways involved in the regulation of *Dana-Farber Cancer Institute and the Department of Cell Biology energy balance. The third requirement is a mechanism by which signals from the periphery and higher brain Harvard Medical School 44 Binney Street centers can act to influence the major physiologic determinants of energy bal...
متن کامل0-primitive Near-rings, Minimal Ideals and Simple Near-rings
We study the structure of 0-primitive near-rings and are able to answer an open question in the theory of minimal ideals in near-rings to the negative, namely if the heart of a zero symmetric subdirectly irreducible near-ring is subdirectly irreducible again. Also, we will be able to classify when a simple near-ring with an identity and containing a minimal left ideal is a Jacobson radical near...
متن کاملLP Relaxation , Rounding , and Randomized Rounding
1.1 Max-flow min-cut A flow network is a directed graph D = (V,E) with two distinguished vertices s and t called the source and the sink, respectively. Moreover, each arc (u, v) ∈ E has a certain capacity c(u, v) ≥ 0 assigned to it. Let X be a proper non-empty subset of V . Let X̄ := V −X , then the pair (X, X̄) forms a partition of V , called a cut of D. The set of arcs of D going from X to X̄ is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Microscopy Today
سال: 1997
ISSN: 1551-9295,2150-3583
DOI: 10.1017/s1551929500061459